منابع مشابه
Boolean Ultrapowers, the Bukovský-dehornoy Phenomenon, and Iterated Ultrapowers
We show that while the length ω iterated ultrapower by a normal ultrafilter is a Boolean ultrapower by the Boolean algebra of Př́ıkrý forcing, it is consistent that no iteration of length greater than ω (of the same ultrafilter and its images) is a Boolean ultrapower. For longer iterations, where different ultrafilters are used, this is possible, though, and we give Magidor forcing and a general...
متن کاملFrom Creature Forcing to Boolean Ultrapowers
We will consider four cardinal characteristics of the continuum, a, b, d, s and discuss how their study has prompted the development of some of the most powerful forcing techniques: creature forcing, coherent systems of iterations, Shelah’s method of template iterations and the method of boolean ultrapowers.
متن کاملAnother note on countable Boolean algebras
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
متن کاملA Note on Complete Boolean Algebras
1. Introduction. Among commutative rings, Boolean algebras stand just below fields in simplicity of structure. In contrast, little is known concerning their classification. The purpose of this paper is to present a decomposition theorem for complete Boolean algebras, which, in a small way, simplifies the classification problem. As an illustration of how this decomposition theorem can be used, i...
متن کاملA Note on Boolean Matrix Theory1
1. Introduction. Let U be a Boolean algebra of a t least two elements .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1974
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1974-0357107-1